Identifying and Explaining Infeasible Assembly Operations
نویسنده
چکیده
This paper presents a knowledge-based method for identifying infeasible assembly operations in the context of assembly sequence planning. In addition the reasons for the infeasibility are identified and these can guide product designers towards the necessary design changes to make a preferred assembly sequence feasible, or guarantee that an assembly sequence includes a specific partial assembly state. This capability increases the usefulness of assembly sequence planners as concurrent engineering tools by contributing to a closer integration between product design and assembly sequence planning. In the identification of infeasible assembly operations the concept of minimal infeasible sets of connections is introduced and two issues are addressed: the knowledge-based generation of these minimal sets, and their suitability to form a basis for a concise explanation of the causes of assembly operation infeasibility. Two simple examples illustrate practical applications of the method.
منابع مشابه
A New Use of Douglas-Rachford Splitting and ADMM for Identifying Infeasible, Unbounded, and Pathological Conic Programs
In this paper, we present a method for identifying infeasible, unbounded, and pathological conic programs based on Douglas-Rachford splitting, or equivalently ADMM. When an optimization program is infeasible, unbounded, or pathological, the iterates of Douglas-Rachford splitting diverge. Somewhat surprisingly, such divergent iterates still provide useful information, which our method uses for i...
متن کاملA New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کاملModelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines
This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...
متن کاملPostural Ergonomic Risk Assessment (Pera) in The Workers of the Automobile Parts Assembly Line: A New Observational Method for the Cube Model
Assembly lines are associated with health risk and musculoskeletal disorders, particularly in the upper limbs. The aim of this study was to analyze three risk factors of posture, duration and force by using the postural ergonomic risk assessment (PERA) method in the workers of the assembly unit of automobile parts. Material and Methods: This descriptive cross-sectional study was conducted in th...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997